基于扩展卡尔曼滤波的雷达无源定位方法

提出了基于扩展卡尔曼滤波的雷达无源定位技术。利用多无人机平台对雷达网进行航迹欺骗,需要对网内的雷达进行定位以达到精确欺骗干扰的目的。但飞行器在飞行过程量测噪声较高,传统的时差定位方法无法满足定位精度的要求。对于时差定位的非线性时变模型,提出了利用时变扩展卡尔曼滤波对雷达位置进行跟踪定位的方法。仿真结果显示,利用扩展卡尔滤波进行无源定位可以在高噪声背景下有较好的定位精度。     

相位差变化率的快速高精度测量及精度分析

由于阵元间相位差变化率这一观测量与通道不一致性关系不大,信号到达两阵元间的相位差变化率常用于无源定位测量中。提出了一种新的快速高精度的相位差变化率测量方法,利用分时间片思想,首先通过对无模糊相位差进行一次相位平移,得到各个时间片含模糊的相位差值;然后对得到的各个时间片的含模糊相位差进行一次相位平移,得到各时间片间相对无模糊的相位差;最后对相对无模糊相位差采用最小二乘算法求得相位差变化率。理论分析和仿真实验表明,本算法可以很好地解决测量中由于相位模糊造成的相位差抖动问题,能够在短时间内得到高精度相位差变化率信息,可以满足定位要求。     

The assignment of storage locations to containers for a container stack

Assigning storage locations to incoming or reshuffled containers is a fundamental problem essential to the operations efficiency of container terminals. The problem is notoriously hard for its combinatorial and dynamic nature. In this article, we minimize the number of reshuffles in assigning storage locations for incoming and reshuffled export containers. For the static problem to empty a given stack without any new container arrival, the optimum reshuffle sequence is identified by an integer program (IP). The integer program captures the evolution of stack configurations as a function of decisions and is of interest by itself. Heuristics based on the integer program are then derived. Their competitiveness in accuracy and time are established by extensive numerical runs comparing them with existing heuristics in literature and in practice as well as with extensions of the existing heuristics. Variants of the IP‐based heuristics are then applied to the dynamic problem with continual retrievals and arrivals of containers. Again, numerical runs confirm that the IP‐based heuristic is competitive. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

A model to design recreational boat mooring fields

This article develops a mathematical model and heuristic algorithm to design recreational boating mooring fields. The boating industry is important to the Florida economy, and boat storage is becoming a concern among those in the industry. The mooring field design problem is formulated to maximize the total number of boat feet moored in the mooring field. In the model, we allow two adjacent moorings to overlap, which introduces a risk that under certain conditions the boats on these moorings could contact each other. We identify the conditions when contact is possible and quantify the probability of contact. The mooring field design problem is formulated as a nonlinear mixed‐integer programming problem. To solve the problem, we decompose it into two separate models, a mooring radii assignment model and a mooring layout model, which are solved sequentially. The first is solved via exhaustive enumeration and the second via a depth‐first search algorithm. Two actual mooring fields are evaluated, and in both cases our model leads to better layouts than ones experts developed manually. The mooring field design model rationalizes the mooring field design and shows that in one case by increasing the risk from 0 to 1%, the mooring efficiency increases from 74.8% to 96.2%. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

人员交通类场所人员荷载研究

对人员交通类场所的特点进行了分析，将人员交通类场所归纳为简单通道、复杂通道、候机（车）厅、进出港厅等组件。针对简单通道和进出港厅，采用“人员流量法”和“人员密度法”两种方法计算人员荷载；针对复杂通道，采用空间上分解为流线、时间上分解为阶段的方法计算人员荷载；针对候机（车）厅，按照设计容量确定人员荷载。并给出了一个包括国家铁路、地铁的综合交通枢纽换乘层人员荷载计算的典型案例。     

分层分布式分群监控体系下的网格资源发现机制

网格中资源发现机制是把资源提供者和资源请求者联系起来的重要环节.在分析分层分布式分群监控体系结构和现有资源发现机制的基础上,提出将集中式目录服务、资源路由表和移动代理三种机制相结合的网格资源发现机制.实验验证该机制在小范围内查找具有性能高效的特点,而在大范围内查找减少了资源发现代理的分发数量,降低了系统消息的负载,进而降低了网络资源的占用.     

基于改进单亲遗传算法的军事物流中心选址问题研究

为了有效求解军事物流中心选址问题，在单亲遗传算法加入模拟退火选择操作，与倒位算子和非均匀变异操作相结合，构建了退火单亲遗传算法。在选择操作中，采用三复本锦标选择的方式，确保了种群的多样性。计算结果表明该方法可有效求解选址问题，取得较一般遗传算法更优的结果，算法的搜索效率和收敛概率均得到大幅度提高。     

基于星载干涉仪测向的辐射源定位综合算法

针对卫星多次观测定位点的估计问题,提出一种不依赖于先验知识的定位点综合算法.该算法首先分析了星载干涉仪测向体制的定位精度,并基于此提出利用定位误差协方差矩阵对定位点进行加权综合的方法.仿真实验表明本文方法可以提高定位精度.     

基于遗传算法的应急物流多设施选址模型研究

在现有研究的基础上,建立了应急物流多设施选址模型。在模型建立过程中除了考虑距离这一基本要素,还考虑了流量与安全性等道路特性,并将其转换为道路的综合权值,使模型更具现实意义。采用遗传算法求解,使该问题的求解过程得到简化。最后用实例对模型进行了验证分析,说明该模型的合理性。     

基于Multi-agent协商的多干扰机资源管理

多干扰机协同是组网雷达对抗的一种重要方法。针对多干扰机协同中面临的数据传输率、时效性等因素所引起的干扰资源管理问题，建立了基于中心控制协商和公约协商的干扰资源管理模型，并给出了相应的协同算法与仿真。仿真结果表明：两种方法在组网雷达对抗中均能取得良好的干扰效果及较低的漏威胁目标信号脉冲比例。其中，基于公约的Multi?agent协商在组网干扰资源管理方面具有更好的可行性，其效果优于基于中心控制协商的方法。